Rigorous constraint satisfaction for sampled linear systems
نویسنده
چکیده
We address a specific but recurring problem related to sampled linear systems. In particular, we provide a numerical method for the rigorous verification of constraint satisfaction for linear continuous-time systems between sampling instances. The proposed algorithm combines elements of classical branch and bound schemes from global optimization with a recently published procedure to bound the exponential of interval matrices.
منابع مشابه
A sampling-based approach to scalable constraint satisfaction in linear sampled-data systems - Part I: Computation
Sampled-data (SD) systems, which are composed of both discreteand continuous-time components, are arguably one of the most common classes of cyberphysical systems in practice; most modern controllers are implemented on digital platforms while the plant dynamics that are being controlled evolve continuously in time. As with all cyberphysical systems, ensuring hard constraint satisfaction is key ...
متن کاملRigorous filtering using linear relaxations
Abstract. This paper presents rigorous filtering methods for continuous constraint satisfaction problems based on linear relaxations. Filtering or pruning stands for reducing the search space of constraint satisfaction problems. Discussed are old and new approaches for rigorously enclosing the solution set of linear systems of inequalities, as well as different methods for computing linear rela...
متن کاملStochastic MPC with Offline Uncertainty Sampling
For discrete-time linear systems subject to parametric uncertainty described by random variables, we develop a samplingbased Stochastic Model Predictive Control algorithm. Unlike earlier results employing a scenario approximation, we propose an offline sampling approach in the design phase instead of online scenario generation. The paper highlights the structural difference between online and o...
متن کاملGLOPTLAB: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
GloptLab is an easy-to-use testing and development platform for solving quadratic constraint satisfaction problems, written in Matlab. The algorithms implemented in GloptLab are used to reduce the search space: scaling, constraint propagation, linear relaxations, strictly convex enclosures, conic methods, and branch and bound. All these methods are rigorous, hence it is guaranteed that no feasi...
متن کاملPlanning, by constraint satisfaction, by inference
If real physical systems need to be make and execute plans, they need to be able to use complex operators and speci cations. There is some support for looking again at planning by constraint satisfaction. One way of doing that in a rigorous convenient way may be to do constraint satisfaction by a form of theorem proving. This paper describes the motivation and ambitions of a programme to do that.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Control
دوره 31 شماره
صفحات -
تاریخ انتشار 2016